Strategic revenue management of preemptive versus non-preemptive queues
نویسندگان
چکیده
Consider a two-class unobservable priority queue, with Poisson arrivals, generally distributed service, and strategic customers. Customers are charged fee when joining the premium class. We analyze maximum revenue achievable under non-preemptive (NP) preemptive-resume (PR) policies, show that provider is always better off implementing PR policy. Further, sometimes achieved only fraction of customers join
منابع مشابه
Competitive Management of Non-preemptive Queues with Multiple Values
We consider the online problem of active queue management. In our model, the input is a sequence of packets with values v ∈ [1, α] that arrive to a queue that can hold up to B packets. Specifically, we consider a FIFO non-preemptive queue, where any packet that is accepted into the queue must be sent, and packets are sent by the order of arrival. The benefit of a scheduling policy, on a given i...
متن کاملOptimal Policies for Multi-server Non-preemptive Priority Queues
We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of ex...
متن کاملMulti-class, multi-server queues with non-preemptive priorities
In this paper we consider a multi-class, multi-server queueing system with non-preemptive priorities. We distinguish two groups of priority classes that consist of multiple items, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times. We derive an approximation method to estimate the steady state probabilities with an app...
متن کاملFrom Preemptive to Non-preemptive Speed-Scaling Scheduling
We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed s then the energy consumption is s units of energy per time unit, where α > 1 is a small constant. Our goal is to find a schedule respecting th...
متن کاملFrom non-preemptive to preemptive scheduling using synchronization synthesis
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2021
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2020.12.011